Rewriting Higher-Order Stack Trees
نویسندگان
چکیده
منابع مشابه
Higher-Order Rewriting
Note: This paper will appear in the proceedings of the 10th international conference on rewriting techniques and applications (RTA'99). c Springer Verlag.
متن کاملResiduals in Higher-Order Rewriting
Residuals have been studied for various forms of rewriting and residual systems have been defined to capture residuals in an abstract setting. In this article we study residuals in orthogonal Pattern Rewriting Systems (PRSs). First, the rewrite relation is defined by means of a higher-order rewriting logic, and proof terms are defined that witness reductions. Then, we have the formal machinery ...
متن کاملHigher-order port-graph rewriting
The biologically inspired framework of port-graphs has been successfully used to specify complex systems. It is the basis of the PORGY modelling tool. To facilitate the specification of proof normalisation procedures via graph rewriting, in this paper we add higher-order features to the original port-graph syntax, along with a generalised notion of graph morphism. We provide a matching algorith...
متن کاملFrom Higher-Order to First-Order Rewriting
We show how higher-order rewriting may be encoded into rst-order rewriting modulo an equational theory E. We obtain a characterization of the class of higher-order rewriting systems which can be encoded by rst-order rewriting modulo an empty theory (that is, E = ;). This class includes of course the-calculus. Our technique does not rely on a particular substitution calculus but on a set of abst...
متن کاملOn Termination of Higher-Order Rewriting
We discuss and compare various methods to prove termination of higher-order rewriting systems.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theory of Computing Systems
سال: 2017
ISSN: 1432-4350,1433-0490
DOI: 10.1007/s00224-017-9769-6